Watermarking algorithm based on a human visual model
نویسندگان
چکیده
This paper presents an additive watermarking technique for grey-scale pictures. It consists in secretly embedding copyright information (a binary code) into the picture without degrading its quality. Those bits are encoded through the phase of maximal length sequences (MLS). MLS are binary sequences with good correlation properties. The result of the autocorrelation is much greater than crosscorrelations, i.e. correlations made with shifted versions of this sequence. The embedded bits are retrieved from the result of the correlations. The core of the embedding process is underlaid by a masking criterion that guarantees the invisibility of the watermark. It is combined with an edge and texture discrimination to determine the embedding level of the MLS, whose bits are actually spread over 32]8 pixel blocks. Eventually, some results are presented, which analyze the efficiency of the retrieval as well as the resistance of the watermark to compression and its robustness against malevolent manipulation. ( 1998 Elsevier Science B.V. All rights
منابع مشابه
Research on Color Watermarking Algorithm Based on RDWT-SVD
In this paper, a color image watermarking algorithm based on Redundant Discrete Wavelet Transform (RDWT) and Singular Value Decomposition (SVD) is proposed. The new algorithm selects blue component of a color image to carry the watermark information since the Human Visual System (HVS) is least sensitive to it. To increase the robustness especially towards affine attacks, RDWT is adopted for its...
متن کاملA chaos-based video watermarking algorithm
The intriguing characteristics of chaotic maps have prompted researchers to use these sequences in watermarking systems to good effect. In this paper we aim to use a tent map to encrypt the binary logo to achieve a like-noise signal. This approach makes extraction of the watermark signal by potential attacker very hard. Embedding locations are selected based on certain principles. Experimental ...
متن کاملIntroducing Capacity Surface to Estimate Watermarking Capacity
One of the most important parameters in evaluating a watermarking algorithm is its capacity. Generally, watermarking capacity is expressed by bits per pixel (bpp) unit measure. But this measure does not show what the side effects would be on image quality, watermark robustness and capacity. In this paper we propose a three dimensional measure named Capacity surface which shows the effects of ca...
متن کاملA survey on digital data hiding schemes: principals, algorithms, and applications
This paper investigates digital data hiding schemes. The concept of information hiding will be explained at first, and its traits, requirements, and applications will be described subsequently. In order to design a digital data hiding system, one should first become familiar with the concepts and criteria of information hiding. Having knowledge about the host signal, which may be audio, image, ...
متن کاملIncreasing the Capacity and PSNR in Blind Watermarking Resist Against Cropping Attacks
Watermarking has increased dramatically in recent years in the Internet and digital media. Watermarking is one of the powerful tools to protect copyright. Local image features have been widely used in watermarking techniques based on feature points. In various papers, the invariance feature has been used to obtain the robustness against attacks. The purpose of this research was based on local f...
متن کاملWatermarking Scheme Based on Multiple Chaotic Maps
a watermarking scheme for Grayscale image isproposed based on a family of the chaotic maps and discretecosine transform. Jacobian Elliptic mapis employed to encrypt ofwatermarked logo. Piecewise nonlinear chaotic map is also usedto determine the location of DCT coefficients for the watermarkembedding. The purpose of this algorithm is to improve theshortcoming of watermarking such as small key s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Signal Processing
دوره 66 شماره
صفحات -
تاریخ انتشار 1998